Dual Priority Scheduling: A Means of Providing Flexibility in Hard Real-time Systems
نویسنده
چکیده
In this paper, we present a new strategy for providing flexibility in hard real-time systems. This approach, based on dual priorities, retains the offline guarantees afforded to crucial tasks by fixed priority scheduling. Further, it provides an efficient method of responsively scheduling soft tasks and a means of providing online guarantees for tasks with firm deadlines. An effective O (n ) acceptance test is derived in the paper. Supported by the analysis, acceptance tests and mechanisms described, the dual priority approach provides a basis for combining the benefits of guaranteeing hard requirements with the flexibility inherent in the besteffort paradigm.
منابع مشابه
Operating Room Scheduling Considering Patient Priorities and Operating Room Preferences: A Case Study
Operating rooms have become the most important areas in hospitals because of the scarcity and cost of resources. The present study investigates operating room scheduling and rescheduling considering the priority of surgical patients in a specialized hospital. The ultimate purpose of scheduling is to minimize patient waiting time, surgeon idle time between surgeries, and penalties for deviations...
متن کاملExtended Global Dual Priority Algorithm for Multiprocessor Scheduling in Hard Real-Time Systems
In this paper we present a global scheduling method for shared memory multiprocessor systems that provides a fixed-priority preemptive scheduling of periodic tasks, hard aperiodic tasks and soft aperiodic tasks on a set of identical processors. The method is based on the functioning of the Dual Priority Scheduling Algorithm extended to work in a multiprocessor environment. This algorithm guaran...
متن کاملnm - Hard deadlines and Dual Priority Scheduling
The problem of effectively scheduling soft tasks whilst guaranteeing the behaviour of hard tasks has been addressed in many papers and a large number of techniques have been proposed. The dual priority mechanism is an intuitively simple method with low overheads. A hard task is assigned two priorities. Upon invocation, the task starts executing with a low priority and it is promoted to a high p...
متن کامل- Hard deadlines and Dual Priority Scheduling
The problem of effectively scheduling soft tasks whilst guaranteeing the behaviour of hard tasks has been addressed in many papers and a large number of techniques have been proposed. The dual priority mechanism is an intuitively simple method with low overheads. A hard task is assigned two priorities. Upon invocation, the task starts executing with a low priority and it is promoted to a high p...
متن کاملScheduling transactions with stringent real-time constraints
Many real-time database systems (RTDBS) are used to support mission-critical applications such as avionics control systems and defense systems, in which transactions have stringent real-time constraints. In these hard real-time systems, a transaction missing its deadline could lead to catastrophic consequences. The difficulties of providing a guarantee of meeting transaction deadlines in hard...
متن کامل